An extremal problem for integer sparse recovery

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Extremal Problem for Polynomials

Let f(z) = z" Hbe a polynomial such that the level set E = {z : |/(z)| < 1} is connected. Then max{|/'(z)| : z e E} < 2<1/")-1n2 , and this estimate is the best possible. The following question was asked in [1, Problem 4.8]. Let f be a polynomial of degree n, (1) f{z)~z», z^oo. Put Ef = {z : \f(z)\ < 1} , and assume that Ef is connected. Is it true that (2) max{\f'(z)\:z£Ef}. Pommerenke ...

متن کامل

An Extremal Problem for Complete Bipartite Graphs

Define f(n, k) to be the largest integer q such that for every graph G of order n and size q, G contains every complete bipartite graph K u, ,, with a+h=n-k . We obtain (i) exact values for f(n, 0) and f(n, 1), (ii) upper and lower bounds for f(n, k) when ku2 is fixed and n is large, and (iii) an upper bound for f(n, lenl) .

متن کامل

An Extremal Problem for Characteristic Functions

Suppose E is a subset of the unit circle T and H∞ ⊂ L∞ is the Hardy subalgebra. We examine the problem of finding the distance from the characteristic function of E to znH∞. This admits an alternate description as a dual extremal problem. Precise solutions are given in several important cases. The techniques used involve the theory of Toeplitz and Hankel operators as well as the construction of...

متن کامل

On an extremal problem for poset dimension

Let f(n) be the largest integer such that every poset on n elements has a 2-dimensional subposet on f(n) elements. What is the asymptotics of f(n)? It is easy to see that f(n) > n. We improve the best known upper bound and show f(n) = O(n). For higher dimensions, we show fd(n) = O ( n d d+1 ) , where fd(n) is the largest integer such that every poset on n elements has a d-dimensional subposet o...

متن کامل

An Extremal Problem for Trigonometric Polynomials

Let T, (x) = Zk=0 (ak cos kx + bk sin kx) be a trigonometric polynomial of degree n. The problem of finding Cnp, the largest value for C in the inequality maxflaol, lall,..., lan? lbil,..., 1bn1} < (1/C) 11Tn11P is studied. We find Cnp exactly provided p is the conjugate of an even integer 2s and n > 2s 1, s = 1, 2,.... For general p, 1 < p < oo,we get an interval estimate for Cnp, where the in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2020

ISSN: 0024-3795

DOI: 10.1016/j.laa.2019.10.005